Clare Copeland and Jan Machielsen (eds.)

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Clare, Clere, and Clères

The name of Clare in Suffolk is one of the few major settlement names in East Anglia of unknown etymology. A similar mystery surrounds the Hampshire names Kingsclere, Highclere, and Burghclere, all containing the element clere which must have a single origin. Clères is a village north of Rouen in Normandy. There is a remarkable lack of variation on the early spellings of all these names, which ...

متن کامل

Copeland voting: ties matter

We study the complexity of manipulation for a family of election systems derived from Copeland voting via introducing a parameter α that describes how ties in head-to-head contests are valued. We show that the thus obtained problem of manipulation for unweighted Copeland elections is NP-complete even if the size of the manipulating coalition is limited to two. Our result holds for all rational ...

متن کامل

Probabilistic Copeland Tournaments

INTRODUCTION We consider a probabilistic model of round-robin tournaments, or equivalently, Copeland voting, where candidates are the voters. We assume that the outcomes of each game or pairwise vote are jointly independent. In particular, we do not assume that votes arise from voters’ ranked orderings of candidates. We can treat such games as pairwise preferences, without assuming any form of ...

متن کامل

Copeland Dueling Bandits

A version of the dueling bandit problem is addressed in which a Condorcet winner may not exist. Two algorithms are proposed that instead seek to minimize regret with respect to the Copeland winner, which, unlike the Condorcet winner, is guaranteed to exist. The first, Copeland Confidence Bound (CCB), is designed for small numbers of arms, while the second, Scalable Copeland Bandits (SCB), works...

متن کامل

Manipulation of copeland elections

We resolve an open problem regarding the complexity of unweighted coalitional manipulation, namely, the complexity of Copeland-manipulation for α ∈ {0, 1}. Copeland, 0 ≤ α ≤ 1, is an election system where for each pair of candidates we check which one is preferred by more voters (i.e., we conduct a head-to-head majority contest) and we give one point to this candidate and zero to the other. How...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Jesuit Studies

سال: 2014

ISSN: 2214-1324,2214-1332

DOI: 10.1163/22141332-00101013